当前位置：
首页 资源下载
搜索资源 - local search algorithm
搜索资源列表
-
0下载：
Local search. Algorithm that explores the space of possible solutions in sequential fashion, moving from a current solution to a \"nearby\" one.
Neighbor relation. Let S S be a neighbor relation for the problem.
Gradient descent. Le
-
-
0下载：
n皇后问题，采用局部搜索算法，普通搜索效率，内含代码。-n queens problem, using a local search algorithm, general search efficiency, containing the code.
-
-
0下载：
禁忌搜索（Tabu search）是局部邻域搜索算法的推广，Fred Glover在1986年提出这个概念，进而形成一套完整算法。
-Tabu search (Tabu search) is a local neighborhood search algorithm for the promotion, Fred Glover in 1986, proposed this idea, thus forming a complete set of algorithms.
-
-
0下载：
This algorithm is used to process the obtained result from using google local search api-This algorithm is used to process the obtained result from using google local search api
-
-
0下载：
A Genetic Algorithm Hybridized with Local Search Operator
-
-
0下载：
Simulated Annealing SA
Hill Climbing HC
Local Beam Search LBS
Genetic Algorithm GA
-Simulated Annealing SA
Hill Climbing HC
Local Beam Search LBS
Genetic Algorithm GA
-
-
0下载：
多进程实现现代优化算法包括采用SSS的局部搜索、禁忌搜索算法和模拟退火算法的控制台-a console platform for modern optimization algorithm such as sss based local search taboo search and simulated annealing algorithm and so on
-
-
1下载：
运用局部搜索算法实现旅行商问题。作者：陈华昌-The use of local search algorithm traveling salesman problem. Author: Chen Huachang
-
-
0下载：
optimization algorithm search local minimum function, very quick
-
-
1下载：
提出一种改进的禁忌搜索算法来求解背包问题。该算法基于禁忌搜索技术,并采用I&D策略,同时设计了两种针对局
部最优解的变异算子。改进后的算法能有效地弥补标准禁忌算法对初始解依赖的缺陷,同时也避免了搜索停滞的现象。通过对具
体实例和随机问题的测试,表明改进后的禁忌搜索算法有更好的性能。
关-An improved tabu search algorithm to solve knapsack problem. The algorithm is based on tabu
-
-
0下载：
这个程序采用局部搜索算法（Local Search），速度很快，
在配置为奔腾200，内存64MB,上测试可以在
几秒钟内解一百万阶的皇后问题。-This procedure using a local search algorithm (Local Search), fast, in the configuration for the Pentium 200, RAM 64MB, the test solution in a few seconds of order 1 million
-
-
0下载：
METSlib提供基本的启发式算法框架，包括局部搜索及其变体，模拟退火和禁忌搜索等。
-METSlib implements the basics of some metaheuristics algorithm:
* Random Restart Local Search
* Variable Neighborhood Search
* Iterated Local Search
* Simulated Annealing (with line
-
-
0下载：
由Helsgaun改进的Lin-Kernighan局部启发搜索算法（LKH）求解大规模TSP问题，使用Java语言实现，具有强大的求解TSP性能。-Helsgaun improved the Lin-Kernighan local search algorithm (LKH) for solving large scale TSP problem, use the Java language, solving the TSP with a strong performance.
-
-
0下载：
电脑鼠走迷宫的局部搜索算法，找出最短路径后返回起点开始冲刺-Computer Mouse Maze of the local search algorithm to find the shortest path back to starting point after the sprint
-
-
0下载：
矩形件优化排样是一个NPC问题，在工业界有着广泛的应用．针对该问题，提出一种自适应模拟退火遗传算法．采用一种基于环形交叉算子和环形变异算子的自适应遗传算法来自动调整交叉和变异概率；同时引入模拟退火算法对个体适应度大于平均适应度的个体进行退火处理．自适应模拟退火遗传算法充分发挥了自适应遗传算法与模拟退火算法各自的全局搜索能力与局部搜索能力．对比实验表明，该算法结合改进的最左最下布局算法解决矩形件优化排样问题更加有效．-Optimal layout is rectangular pieces of
-
-
2下载：
GSO算法及其改进，其中HGSO是通过与和声搜索算法结合而成，主要用于结构的截面优化、几何优化、动力优化、拓扑优化等，具有收敛速度快，收敛结果好的优点，且其改进算法能摆脱局部最优的缺陷。-GSO algorithm and its improvements, HGSO is through a combination of harmony search algorithm, mainly used to optimize the structure of the cross section, g
-
-
0下载：
提出一种基于改进粒子群动态搜索算法的网络重构方法，算法把初始粒子群按照适应度的大小分为两个互不交叉，且具有不同分工的子群，并进行动态搜索。通过引入了交叉和禁忌思想，减少了解陷入局部最优的可能性．与遗传、禁忌搜索算法重构的结果进行比较，表明本文算法具有更高的搜索效率，更容易找到全局最优解．-：An improved method based on improved particle swarm optimization dynamic search algodthm networkrcconfig
-
-
0下载：
In this paper we present the systematic trajectory search
algorithm (STSA) which first globally explores the solution
space then makes thorough local searches in promising areas.
The STSA has been tested on training feedforward neural
network
-
-
1下载：
通过加入Late Acceptance Strategy，改进了爬山局部搜索算法，该算法在求解某些benchmark函数时，比禁忌搜索和模拟退火等局部搜索算法更好。(by Late Acceptance Strategy, An improved hill climbing local search algorithm is proposed which outperforms Tabu and SA when solving some benchmark functions.)
-
-
0下载：
GRASP (greedy randomized adaptive search Procedure) is an algorithm commonly applied to problems of combinatorial optimization. As various construction methods, the application of grasp is to create an initial solution and then perform a local search
-
